Boundedness of Reset P/T Nets
نویسندگان
چکیده
P/T nets with reset and transfer arcs can be seen as counter-machines with some restricted set of operations. Surprisingly, several problems related to boundedness are harder for Reset nets than for the more expressive Transfer nets. Our main result is that boundedness is undecidable for nets with three reset arcs, while it is decidable for nets with two resetable places.
منابع مشابه
Reset nets between decidability
We study Petri nets with Reset arcs (also Transfer and Doubling arcs) in combination with other extensions of the basic Petri net model. While Reachability is undecidable in all these extensions (indeed they are Turing-powerful), we exhibit unexpected frontiers for the decid-ability of Termination, Coverability, Boundedness and place-Boundedness. In particular, we show counter-intuitive separat...
متن کاملReduction Rules For Reset WorkFlow Nets
When a workflow contains a large number of tasks and involves complex control flow dependencies, verification can take too much time or it may even be impossible. Reduction rules can be used to abstract from certain transitions and places in a large net and thus could cut down the size of the net used for verification. Petri nets have been proposed to model and analyse workflows and Petri nets ...
متن کاملReduction rules for reset/inhibitor nets
Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. These extensions can be used to model cancelation and blocking. A reset arc allows a transition to remove all tokens from a certain place when the transition fires. An inhibitor arc can stop a transition from being enabled if the place contains one or more tokens. While reset/inhibitor nets increase the expressive ...
متن کاملA Polynomial-Bisimilar Normalization for Reset Petri Nets
Reset Petri nets extend Petri nets by allowing transitions to empty places, in addition with the usual adding of removing of constants. A Reset Petri net is normalized if the ow function over the Petri arcs (labeled with integers) and the initial state are valuated into f0; 1g. In this paper, we give an eecient method to turn a general Reset Petri net into a-bisimilar normalized Reset Petri net...
متن کاملDecidability and complexity of Petri nets with unordered data
We prove several decidability and undecidability results for ν-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of ν-PN strictly surpasses that of P/T nets. We encode ν-PN into Petri Data Nets, so that coverability, termination...
متن کامل